List scheduling of general task graphs under LogP
نویسندگان
چکیده
منابع مشابه
List scheduling of general task graphs under LogP
List scheduling is the most frequently used scheduling technique. In this context worst case analysis as well as many experimental studies were performed for various computational models. However, many new models have been proposed during the last decade with the aim to provide a realistic but still simple and general model of parallel computation. LogP is one of the most popular models so far ...
متن کاملScheduling balanced task-graphs to LogP-machines
This article discusses algorithms for scheduling task graphs G V E to LogP machines These algorithms depend on the granularity of G i e on the ratio of computation v and communication times in the LogP cost model and on the structure of G We de ne a class of coarse grained task graphs that can be scheduled with a performance guarantee of Topt G where Topt G is the time required for the optimal ...
متن کاملNovel List Scheduling Strategies for Data Parallelism Task Graphs
This paper studies task scheduling algorithms which schedule a set of tasks on multiple cores so that the total scheduling length is minimized. Most of the algorithms developed in the past assume that a task is executed on a single core. Unlike the previous algorithms, the algorithms studied in this paper allow a task to be executed on multiple cores. This paper proposes six algorithms. All of ...
متن کاملGeneral Multiprocessor Task Scheduling
Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one-job-on-one-machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocation, and manufacturing systems that may require several resources simultaneously to process a job...
متن کاملList Scheduling for Iterative Data-flow Graphs
List Scheduling for Iterative Data-Flow Graphs Martin S. Koster and Sabih H. Gerez University of Twente, Department of Electrical Engineering P.O. Box 217, 7500 AE Enschede, The Netherlands e-mail: [email protected] or [email protected] Abstract This paper presents a scheduling method for the high-level synthesis of DSP algorithms described by iterative data ow graphs with an iterati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2000
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(00)00031-4